A Specialized Interior-Point Algorithm for Multicommodity Network Flows
نویسنده
چکیده
Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The new specialized interior-point algorithm presented here overcomes this drawback. This specialization uses both a preconditioned conjugate gradient solver and a sparse Cholesky factorization to solve a linear system of equations at each iteration of the algorithm. The ad hoc preconditioner developed by exploiting the structure of the problem is instrumental in ensuring the efficiency of the method. An implementation of the algorithm is compared to state-of-the-art packages for multicommodity flows. The computational experiments were carried out using an extensive set of test problems, with sizes of up to 700,000 variables and 150,000 constraints. The results show the effectiveness of the algorithm.
منابع مشابه
Solving Quadratic Multicommodity Problems through an Interior-Point Algorithm
Standard interior-point algorithms usually show a poor performance when applied to multicommodity network flows problems. A recent specialized interior-point algorithm for linear multicommodity network flows overcame this drawback, and was able to efficiently solve large and difficult instances. In this work we perform a computational evaluation of an extension of that specialized algorithm for...
متن کاملComputational Experience with a Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [6] is presented. In this algorithm, the positive definite systems of each iteration are solved through a scheme that combines direct factorizations and a preconditioned conjugate gradient (PCG) method. Although this numerical procedure works well in practice, it requires the sol...
متن کاملImproving an interior-point algorithm for multicommodity flows by quadratic regularizations
One of the best approaches for some classes of multicommodity flow problems is a specialized interior-point method that solves the normal equations by a combination of Cholesky factorizations and preconditioned conjugate gradient. Its efficiency depends on the spectral radius—in [0,1)—of a certain matrix in the definition of the preconditioner. In a recent work the authors improved this algorit...
متن کاملA Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
A parallel implementation of the specialized interior-point algorithm for multicommodity network ows introduced in [5] is presented. In this algorithm, the positive de nite systems of each iteration are solved through a scheme that combines direct factorization and a preconditioned conjugate gradient (PCG) method. Since the solution of at least k independent linear systems is required at each i...
متن کاملSolving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm
Due to recent advances in the development of linear programming solvers, some of the formerly considered difficult multicommodity problems can today be solved in few minutes, even faster than with specialized methods. However, for other kind of multicommodity instances, general linear solvers can still be quite inefficient. In this paper we will give an overview of the current state-of-the-art ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 10 شماره
صفحات -
تاریخ انتشار 2000